离散KP系列的规范变换的行列式表示

本文定义了离散KP(dKP)系列的多次规范变换算子Tn+k,其中涉及两种基本类型的规范变换算子.进一步,我们建立了算子Tn+k的行列式表示,并利用该表示从一个初始的dKP系列的τ△函数出发,得到了经过多次规范变换后的dKP系列的τ函数τ△(n+k).在这一过程中,我们引入了广义的离散Wronskian行列式,并且证明了离散差分算子的一些有用的性质.     

Matrix Representation of Recursive Sequences of Order $3$ and Its Applications

Here presented is a matrix representation of recursive number sequences of order $3$ defined by $a_n=pa_{n-1}+qa_{n-2}+ra_{n-3}$ with arbitrary initial conditions $a_0,$ $a_1=0$, and $a_2$ and their special cases of Padovan number sequence and Perrin number sequence with initial conditions $a_0=a_1=0$ and $a_2=1$ and $a_0=3$, $a_1=0$, and $a_2=2$, respectively. The matrix representation is used to construct many well known and new identities of recursive number sequences as well as Pavodan and Perrin sequences.     

矩阵特征多项式的图论计算公式

给出了赋权有向图邻接矩阵特征多项式的图论计算公式,从而得到了一般矩阵特征多项式的图论计算方法,并且研究了赋权有向图邻接矩阵特征多项式和谱半径的一些性质．     

工件间具有串并有向图约束的单机随机排序问题

研究机器发生随机故障的单机排序问题,其中工件间的优先约束为串并有向图,目标函数为极小化加权完工时间和,证明了此问题多项式时间可解,并给出了多项式时间算法.     

具有优先约束的单机随机排序问题

讨论工件的加工时间为常数,机器发生随机故障的单机随机排序问题,目标函数极小化工件的加权完工时间和的数学期望最小.考虑两类优先约束模型.在第一类模型中,设工件间的约束为串并有向图.证明了模块M的ρ因子最大初始集合I中的工件优先于模块中的其它工件加工,并且被连续加工所得的排序为最优排序,从而将Lawler用来求解约束为串并有向图的单机加权总完工时间问题的方法推广到机器发生随机故障的情况.在第二类模型中,设工件间的约束为出树优先约束.证明了最大家庭树中的工件优先于家庭树中其它的工件加工,并且其工件连续加工所得到的排序为最优排序并给出了最优算法.     

条件样本函数极值中$\gamma^2$的估计方法

本文对条件样本函数极值中$\gamma^2$的估计进行了探讨,给出了$\gamma^2$估计的一种新方法------自助法,并对所得到的统计量的性质进行了分析.     

无$K_{1,4}$子图的图的路覆盖

For a graph G, a path cover is a set of vertex disjoint paths covering all the vertices of G, and a path cover number of G, denoted by p(G), is the minimum number of paths in a path cover among all the path covers of G. In this paper, we prove that if G is a K_(1,4)-free graph of order n and σ_(k+1)(G) ≥ n-k, then p(G) ≤ k, where σ_(k+1)(G) = min{∑v∈S d(v) : S is an independent set of G with |S| = k + 1}.     

解一般矩阵方程的GPBiCG(m,l)法

The generalized product bi-conjugate gradient(GPBiCG(m,l))method has been recently proposed as a hybrid variant of the GPBi CG and the Bi CGSTAB methods to solve the linear system Ax=b with non-symmetric coefficient matrix,and its attractive convergence behavior has been authenticated in many numerical experiments.By means of the Kronecker product and the vectorization operator,this paper aims to develop the GPBi CG(m,l)method to solve the general matrix equation■ and the general discrete-time periodic matrix equations■ which include the well-known Lyapunov,Stein,and Sylvester matrix equations that arise in a wide variety of applications in engineering,communications and scientific computations.The accuracy and efficiency of the extended GPBi CG(m,l)method assessed against some existing iterative methods are illustrated by several numerical experiments.     

一种广义Kautz有向图G_K(3,n)的减圈数

利用无圈子图顶点集的构造方法,研究了一类重要的互联网络拓扑结构Kautz网络图G_K(3,n)的减圈数,用f(3,n)表示广义Kautz有向图G_K(3,n)的减圈数,得到f(3,n)的上界为f(3,n)≤7/(18)n-3/2t+10.